Direct multiplicative methods for sparse matrices. Linear programming
نویسندگان
چکیده
منابع مشابه
Direct linear time solvers for sparse matrices
In the last couple of years it has been realized that Gaussian elimination for sparse matrices arising from certain elliptic PDEs can be done in O(n log(1/ )) flops, where n is the number of unknowns and is a user-specified tolerance [Chandrasekaran and Gu]. The resulting solver will also be backward stable with an error of O( ). The techniques used to achieve this speedup has some commonality ...
متن کاملDirect Solvers for Sparse Matrices
There is a vast variety of algorithms associated with each step. The review papers by Duff [16] (see also [15, Chapter 6]) and Heath et al. [27] can serve as excellent reference of various algorithms. Usually steps 1 and 2 involve only the graphs of the matrices, and hence only integer operations. Steps 3 and 4 involve floating-point operations. Step 3 is usually the most time-consuming part, w...
متن کاملA survey of direct methods for sparse linear systems
Wilkinson defined a sparse matrix as one with enough zeros that it pays to take advantage of them. This informal yet practical definition captures the essence of the goal of direct methods for solving sparse matrix problems. They exploit the sparsity of a matrix to solve problems economically: much faster and using far less memory than if all the entries of a matrix were stored and took part in...
متن کاملSparse ensembles using weighted combination methods based on linear programming
An ensemble of multiple classifiers is widely considered to be an effective technique for improving accuracy and stability of a single classifier. This paper proposes a framework of sparse ensembles and deals with new linear weighted combination methods for sparse ensembles. Sparse ensemble is to sparsely combine the outputs of multiple classifiers by using a sparse weight vector. When the cont...
متن کاملMixed Mode Programming for Sparse Linear Algebra
Sparse linear algebra algorithms, and especially algorithms for the iterative solution of sparse lineary systems, lie at the heart of many scientific computing applications, ranging from computational fluid dynamics to structural engineering and electromagnetic analysis. Their efficient implementation is thus a very important challenge for the numerical software community. The current trend in ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computer Research and Modeling
سال: 2017
ISSN: 2076-7633,2077-6853
DOI: 10.20537/2076-7633-2017-9-2-143-165